Search results for "Random search"
showing 6 items of 6 documents
The effect of maze complexity on maze-solving time in a desert ant
2019
One neglected aspect of research on foraging behavior is that of the effect of obstacles that increase habitat complexity on foraging efficiency. Here, we explored how long it takes individually foraging desert ant workers (Cataglyphis niger) to reach a food reward in a maze, and examined whether maze complexity affects maze-solving time (the time elapsed till the first worker reached the food reward). The test mazes differed in their complexity level, or the relative number of correct paths leading to the food reward, vs. wrong paths leading to dead-ends. Maze-solving time steeply increased with maze complexity, but was unaffected by colony size, despite the positive correlation between co…
Chemo-orientation responses in hymenopteran parasitoids induced by substrate-borne semiochemicals
2013
Hymenopteran parasitoids can utilize substrate-borne semiochemicals released by conspecifics or by their hosts, increasing the likelihood of successful mating and host location. According to the literature, two substrate-borne chemo-orientation patterns can occur: (1) biased random searching, a non-directional reaction toward the chemicals (kinesis), and (2) trailfollowing searching, a directional response toward the source emitting the chemical compounds (taxis). These two different strategies can be adopted by parasitoids to locate hosts and mates. In host location, random searching is induced by allelochemicals indirectly associated with the host, whereas trail-following behavior is indu…
Acoustic Detection of Moving Vehicles
2018
This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…
An LP-based hyperparameter optimization model for language modeling
2018
In order to find hyperparameters for a machine learning model, algorithms such as grid search or random search are used over the space of possible values of the models hyperparameters. These search algorithms opt the solution that minimizes a specific cost function. In language models, perplexity is one of the most popular cost functions. In this study, we propose a fractional nonlinear programming model that finds the optimal perplexity value. The special structure of the model allows us to approximate it by a linear programming model that can be solved using the well-known simplex algorithm. To the best of our knowledge, this is the first attempt to use optimization techniques to find per…
Variable neighborhood search for the linear ordering problem
2006
Given a matrix of weights, the linear ordering problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This NP-complete problem can also be formulated in terms of graphs, as finding an acyclic tournament with a maximal sum of arc weights in a complete weighted graph. In this paper, we first review the previous methods for the LOP and then propose a heuristic algorithm based on the variable neighborhood search (VNS) methodology. The method combines different neighborhoods for an efficient exploration of the search space. We explore different search strategies and propose a hybrid method in which the VNS is cou…
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
1998
The Minimal Consistent Subset Selection (MCSS) problem is a discrete optimization problem whose resolution for large scale instances requires a prohibitive processing time. Prior algorithms addressing this problem are presented. Randomization and approximation techniques are suitable to face the problem, then random search and meta-heuristics are proposed and consequently Tabu Search strategies are applied and evaluated. Parallel computing helps to reduce processing time and/or produce better results; different approaches for designing parallel tabu search are analyzed.